Quantum speedup in adaptive boosting of binary classification
نویسندگان
چکیده
منابع مشابه
Applications of Binary Classification and Adaptive Boosting to the Query-By-Humming Problem
In the query-by-humming problem, we attempt to retrieve a speci c song from a target set based on a sung query. Recent evaluations of query-by-humming systems show that the state-of-the-art algorithm is a simple dynamic programming-based interval matching technique. Other techniques based on hidden Markov models are far more expensive computationally and do not appear to offer signi cant incr...
متن کاملQuantum speedup by quantum annealing.
We study the glued-trees problem from A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. Spielman, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing (ACM, San Diego, CA, 2003), p. 59. in the adiabatic model of quantum computing and provide an annealing schedule to solve an oracular problem exponentially faster than classically possible. The Hamiltonians involve...
متن کاملQuantum speedup in stoquastic adiabatic quantum computation
Quantum computation provides exponential speedup for solving certain mathematical problems against classical computers. Motivated by current rapid experimental progress on quantum computing devices, various models of quantum computation have been investigated to show quantum computational supremacy. At a commercial side, quantum annealing machine realizes the quantum Ising model with a transver...
متن کاملQBoost: Predicting quantiles with boosting for regression and binary classification
0957-4174/$ see front matter 2011 Elsevier Ltd. A doi:10.1016/j.eswa.2011.06.060 ⇑ Tel.: +1 417 836 6037; fax: +1 417 836 6966. E-mail address: [email protected] In the framework of functional gradient descent/ascent, this paper proposes Quantile Boost (QBoost) algorithms which predict quantiles of the interested response for regression and binary classification. Quantile Boost Re...
متن کاملBoosting Based Conditional Quantile Estimation for Regression and Binary Classification
We introduce Quantile Boost (QBoost) algorithms which predict conditional quantiles of the interested response for regression and binary classification. Quantile Boost Regression (QBR) performs gradient descent in functional space to minimize the objective function used by quantile regression (QReg). In the classification scenario, the class label is defined via a hidden variable, and the quant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Physics, Mechanics & Astronomy
سال: 2020
ISSN: 1674-7348,1869-1927
DOI: 10.1007/s11433-020-1638-5